Visibility-based probabilistic roadmaps for motion planning
نویسندگان
چکیده
This paper presents a variant of probabilistic roadmap methods (PRM) that recently appeared as a promising approach to motion planning. We exploit a free-space structuring of the con guration space into visibility domains in order to produce small roadmaps, called visibility roadmaps. Our algorithm integrates an original termination condition related to the volume of the free space covered by the roadmap. The planner has been implemented within a software platform allowing us to address a large class of mechanical systems. Experiments show the ef ciency of the approach, in particular for capturing narrow passages of collision-free con guration spaces.
منابع مشابه
Visibility based probabilistic roadmaps
This paper presents a variant of probabilistic roadmap algorithms that recently appeared as a promising approach to motion planning. We exploit a free-space structuring of the connguration space into visibility domains in order to produce small roadmaps. The algorithm has been implemented within a software platform allowing to address a large class of mechanical systems. Experiments show the ee...
متن کاملPath Deformation Roadmaps: Compact Graphs with Useful Cycles for Motion Planning
This paper describes a new approach to sampling-based motion planning with PRMmethods. Our aim is to compute good quality roadmaps that encode the multiple connectedness of the configuration space inside small but yet representative graphs that capture well the different varieties of free paths. The proposed Path Deformation Roadmaps (PDR) rely on a notion of path deformability indicating wheth...
متن کاملPath Deformation Roadmaps
This paper describes a new approach to sampling-based motion planning with PRM methods. Our aim is to compute good quality roadmaps that encode the multiple connectedness of the configuration space inside small but yet representative graphs that capture well the different varieties of free paths. The proposed Path Deformation Roadmaps (PDR) rely on a notion of path deformability indicating whet...
متن کاملHelicopter Path Planning using Probabilistic Roadmaps
Probabilistic roadmap algorithms work in two stages. In the first, by randomly choosing collision free configurations of a robot and then attempting to connect these, a graph is created which represents the free space of the robot’s environment. This graph can then be used to answer path planning queries during runtime. In this report I describe an adaptation of this algorithm to the domain of ...
متن کاملConstructing probabilistic roadmaps with powerful local planning and path optimization
This paper describes a new approach to probabilistic roadmap construction for path planning. The novel feature of the planner is that it uses a powerful local planner to produce highly connected roadmaps and path optimization to maintain the rapid query processing by a fast local operator. While most previous approaches obtain good roadmaps by advanced sampling methods, the presented approach c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Advanced Robotics
دوره 14 شماره
صفحات -
تاریخ انتشار 2000